Reasoning with Disjunctive Constrained Tuple-Generating Dependencies

Explorer Guarded - Based Disjunctive Tuple - Generating Dependencies

Expressive Completeness of Existential Rule Languages for Ontology-Based Query Answering

Existential rules, also known as data dependencies in Databases, have been recently rediscovered as a promising family of languages for Ontology-based Query Answering. In this paper, we prove that disjunctive embedded dependencies exactly capture the class of recursively enumerable ontologies in Ontology-based Conjunctive Query Answering (OCQA). Our expressive completeness result does not rely ...

A Guarded-Based Disjunctive Tuple-Generating Dependencies

Rule-based languages lie at the core of several areas of central importance to databases and artificial intelligence, such as data exchange, deductive databases, and knowledge representation and reasoning, to name a few. An algorithmic task that involves rules and is crucial for the above applications is query answering. In this work, we perform an in-depth complexity analysis of query answerin...

Chasing Constrained

We investigate the implication problem for constrained tuple-generating dependencies (CTGDs), the extension of tuple-and equality-generating dependencies that permits expression of semantic relations (constraints) on variables. The implication problem is central to identifying redundant integrity constraints, checking integrity constraints on constraint databases, detecting the independence of ...

Functional Dependencies Unleashed for Scalable Data Exchange

We address the problem of efficiently evaluating target functional dependencies (fds) in the Data Exchange (DE) process. Target fds naturally occur in many DE scenarios, including the ones in Life Sciences in which multiple source relations need to be structured under a constrained target schema. However, despite their wide use, target fds’ evaluation is still a bottleneck in the state-of-the-a...